Silent alarm: Link lifetime prediction for reliable routing in VANET

Transmission of silent alarm messages from a target stolen vehicle node to its final destination node, such as a Police Station, is an attempt to deter problems related to vehicle theft by exploiting the VANET technology.This paper proposed a forwarding scheme for sending silent alarm messages between any two vehicle nodes in a VANET topology based on prediction of link reliability between them.Based on this single hop link prediction, the transmission of silent alarm messages through a complete route can be expected to be efficient and safe using the platform of vehicle to-vehicle communication and vehicle-to-roadside infrastructure on a highway. Two communication scenarios are considered: when the two vehicles are moving in the same direction and when they are moving in the opposite direction to each others.The strategy for computing a reliable link is based on lifetime prediction technique.The performance of this technique for link reliability will be evaluated using MATLAB simulation

A review of routing protocols for child tracking in wireless sensor network

One of the widespread types of crime is child kidnapping where the number of cases is increasing each year. With the modern telecommunication technology, the child protection should be better now than before. This paper presents a preliminary study on routing protocol for child tracking using combined infrastructure of Wireless Sensor Network and Cellular Network. The real-time application in these networks would help the related parties to track the location of the missing child. From proactive point of view, the application would act as a preventive tool for child kidnapping. When the sensors in a Wireless Sensor Network detect child’s presence, they have to transmit the data to an Access Point or the sink node in the network. Many routing protocols have been developed in the past, and all of them have their advantages and disadvantages. The outcome of this study is the selection of a routing protocol that is suitable for child tracking in Wireless Sensor Network

An Energy Efficient Simultaneous-Node Repositioning Algorithm for Mobile Sensor Networks

Recently, wireless sensor network (WSN) applications have seen an increase in interest. In search and rescue, battlefield reconnaissance, and some other such applications, so that a survey of the area of interest can be made collectively, a set of mobile nodes is deployed. Keeping the network nodes connected is vital for WSNs to be effective. The provision of connectivity can be made at the time of startup and can be maintained by carefully coordinating the nodes when they move. However, if a node suddenly fails, the network could be partitioned to cause communication problems. Recently, several methods that use the relocation of nodes for connectivity restoration have been proposed. However, these methods have the tendency to not consider the potential coverage loss in some locations. This paper addresses the concerns of both connectivity and coverage in an integrated way so that this gap can be filled. A novel algorithm for simultaneous-node repositioning is introduced. In this approach, each neighbour of the failed node, one by one, moves in for a certain amount of time to take the place of the failed node, after which it returns to its original location in the network. The effectiveness of this algorithm has been verified by the simulation results

EAP authentication mechanism for Ad Hoc wireless LAN

Wireless networks have some security issues, mainly due to its wireless nature (open and non-physical), that need to be addressed. One of the solutions to improve wireless network security is the IEEE 802.1X specification, which is based on Extensible Authentication Protocol (EAP). EAP is an authentication framework that can support multiple authentication methods. With its advantage of being flexible, EAP has been used in many types of networks, wired and wireless, including the infrastructure model of wireless LAN. With EAP’s flexibility, it might be also possible to use EAP as a generic authentication mechanism in other types of networks. This paper studies and explores the feasibility of using EAP in ad-hoc model of WLAN and proposes a mechanism to implement EAP in ad hoc WLAN based on EAP multiplexing model. We also propose a mechanism to select a suitable EAP method out of a set of EAP methods to be used in authentication process in heterogeneous wireless network, in which there are different types of nodes with different specifications and capabilities in the network. Thus, each node may support a different type of EAP authentication method. Toward the end of this paper, we formally specify and verify the proposed authentication mechanism in order to proof and obtain strong beliefs of the authentication

Sleep/wake scheduling scheme for minimizing end-to-end delay in multi-hop wireless sensor networks

<p>Abstract</p> <p>We present a sleep/wake schedule protocol for minimizing end-to-end delay for event driven multi-hop wireless sensor networks. In contrast to generic sleep/wake scheduling schemes, our proposed algorithm performs scheduling that is dependent on traffic loads. Nodes adapt their sleep/wake schedule based on traffic loads in response to three important factors, (a) the distance of the node from the sink node, (b) the importance of the node's location from connectivity's perspective, and (c) if the node is in the proximity where an event occurs. Using these heuristics, the proposed scheme reduces end-to-end delay and maximizes the throughput by minimizing the congestion at nodes having heavy traffic load. Simulations are carried out to evaluate the performance of the proposed protocol, by comparing its performance with S-MAC and Anycast protocols. Simulation results demonstrate that the proposed protocol has significantly reduced the end-to-end delay, as well as has improved the other QoS parameters, like average energy per packet, average delay, packet loss ratio, throughput, and coverage lifetime.</p